﻿////#include <iostream>
////#include <vector>
////#include<string>
////#include <utility>
////using namespace std;
////string replace(string p, vector<int> IP) {
////    string sum;
////    for (int i : IP)
////    {
////        sum += p[i]; 
////    }
////    return sum;
////}
////string sBox(string r, vector<vector<int>> box) {
////    int row = (r[0] - '0') * 2 + (r[3] - '0');
////    int col = (r[1] - '0') * 2 + (r[2] - '0');
////    int date = box[row][col];
////    if (date == 0)
////    {
////        return "00";
////    }
////    else if (date == 1)
////    {
////        return "01";
////    }
////    if (date == 2)
////    {
////        return  "10";
////    }
////    else
////    {
////        return "11";
////    }
////}
////string leftshift(string s, int n) 
////{
////    n %= 4;
////    return s.substr(n) + s.substr(0, n);
////}
////
////string f(string r, string key) {
////    vector<int> E = { 3,0,1,2,1,2,3,0 };
////    vector<int> P = { 1,3,2,0 };
////    vector<vector<int>> S2 = {
////        {1,0,3,2},
////        {3,2,1,0},
////        {0,2,1,3},
////        {3,1,3,2}
////    };
////    vector<vector<int>> S1 = {
////        {0,1,2,3},
////        {2,0,1,3},
////        {3,0,1,0},
////        {2,1,0,3}
////    };
////    string expanded = replace(r, E);
////    string result1;
////    for (int i = 0; i < 8; i++)
////    {
////        if (expanded[i] != key[i])
////        {
////            result1 += '1';
////        }
////        else
////        {
////            result1 += '0';
////        }
////    }
////    string left = result1.substr(0, 4);
////    string right = result1.substr(4, 4);
////    string s1 = sBox(left, S1);
////    string s2 = sBox(right, S2);
////    string add = s1 + s2;
////    return replace(add, P);
////}
////pair<string,string> change2(string key)
////{
////    vector<int> IP1 = { 2,4,1,6,3,9,0,8 };
////    vector<int> IP1_ = { 5,2,6,3,7,4,0,1 };
////    string sum1 = replace(key, IP1);
////    string k0 = sum1.substr(0, 4);
////    string k1 = sum1.substr(4, 4);
////    string k0l = leftshift(k0, 1);
////    string k1l = leftshift(k1, 1);
////    string k2 = replace(k0l + k1l, IP1_);
////    k0l = leftshift(k0l, 2);
////    k1l = leftshift(k1l, 2);
////    string k3 = replace(k0l + k1l, IP1_);
////    return { k2, k3 };
////}
////string change1(string p, string key)
////{
////    vector<int> IP = { 1,5,2,0,3,7,4,6 };
////    vector<int> IP_= { 3,0,2,4,6,1,7,5 };
////    string sum = replace(p, IP);
////    string L0 = sum.substr(0, 4);
////    string R0 = sum.substr(4, 4);
////    pair<string, string> keys = change2(key);  
////    string k1 = keys.first;  
////    string k2 = keys.second; 
////    string L1 = R0;
////    string f1 = f(R0, k1);
////    string R1;
////    for (int i = 0; i < 4; i++) 
////    {
////        if (L0[i] != f1[i])
////        {
////            R1 += '1';
////        }
////        else
////        {
////            R1 += '0';
////        }
////    }
////    string L1_= R1;
////    string R1_ = L1;
////    string f2 = f(R1_, k2);
////    string L2 = R1;
////    string R2;
////    for (int i = 0; i < 4; i++) 
////    {
////        if (L1[i] != f2[i])
////        {
////            R2 += '1';
////        }
////        else
////        {
////            R2 += '0';
////        }
////    }
////    string result= L2 + R2;
////    string result1=replace(result, IP_);
////    return result1;
////}
////int main()
////{
////    string p;
////    string key;
////    cin >> p >> key;
////    string result=change1(p, key);
////    cout << result<< endl;
////    return 0;
////}
////string change(string c, string key)
////{
////    int 
////}
////#include <iostream>
////using namespace std;
////int main()
////{
////    string c;
////    string key;
////    cin >> c >> key;
////    string result=change(c, key);
////    cout << result << endl;
////    cout << result << endl;
////    return 0;
////}
//#include <stdio.h>
//#include <stdlib.h>
//#include <string.h>
//#include <stdint.h>
//#include <inttypes.h>
//#include <iostream>
//using namespace std;
//uint64_t key64, mesg64, res64;
//// 保留原DES所有置换表、S盒定义（核心加密逻辑不变）
//int IP[] = { 58,50,42,34,26,18,10,2,60,52,44,36,28,20,12,4,62,54,46,38,30,22,14,6,64,56,48,40,32,24,16,8,57,49,41,33,25,17,9,1,59,51,43,35,27,19,11,3,61,53,45,37,29,21,13,5,63,55,47,39,31,23,15,7 };
//int E[] = { 32,1,2,3,4,5,4,5,6,7,8,9,8,9,10,11,12,13,12,13,14,15,16,17,16,17,18,19,20,21,20,21,22,23,24,25,24,25,26,27,28,29,28,29,30,31,32,1 };
//int P[] = { 16,7,20,21,29,12,28,17,1,15,23,26,5,18,31,10,2,8,24,14,32,27,3,9,19,13,30,6,22,11,4,25 };
//int FP[] = { 40,8,48,16,56,24,64,32,39,7,47,15,55,23,63,31,38,6,46,14,54,22,62,30,37,5,45,13,53,21,61,29,36,4,44,12,52,20,60,28,35,3,43,11,51,19,59,27,34,2,42,10,50,18,58,26,33,1,41,9,49,17,57,25 };
//int S1[4][16] = { {14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7},{0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8},{4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0},{15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13} };
//int S2[4][16] = { {15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10},{3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5},{0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15},{13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9} };
//int S3[4][16] = { {10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8},{13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1},{13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7},{1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12} };
//int S4[4][16] = { {7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15},{13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9},{10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4},{3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14} };
//int S5[4][16] = { {2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9},{14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6},{4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14},{11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3} };
//int S6[4][16] = { {12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11},{10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8},{9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6},{4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13} };
//int S7[4][16] = { {4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1},{13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6},{1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2},{6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12} };
//int S8[4][16] = { {13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7},{1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2},{7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8},{2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11} };
//int PC1[] = { 57,49,41,33,25,17,9,1,58,50,42,34,26,18,10,2,59,51,43,35,27,19,11,3,60,52,44,36,63,55,47,39,31,23,15,7,62,54,46,38,30,22,14,6,61,53,45,37,29,21,13,5,28,20,12,4 };
//int PC2[] = { 14,17,11,24,1,5,3,28,15,6,21,10,23,19,12,4,26,8,16,7,27,20,13,2,41,52,31,37,47,55,30,40,51,45,33,48,44,49,39,56,34,53,46,42,50,36,29,32 };
//int SHIFTS[] = { 1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1 };
//
//// 原代码函数定义保持不变
//FILE* out;
//int LEFT[17][32], RIGHT[17][32];
//int IPtext[64];
//int EXPtext[48];
//int XORtext[48];
//int X[8][6];
//int X2[32];
//int R[32];
//int key56bit[56];
//int key48bit[17][48];
//int CIPHER[64];
//int ENCRYPTED[64];
//
//void expansion_function(int pos, int text) {
//    for (int i = 0; i < 48; i++)
//        if (E[i] == pos + 1)
//            EXPtext[i] = text;
//}
//
//int initialPermutation(int pos, int text) {
//    int i;
//    for (i = 0; i < 64; i++)
//        if (IP[i] == pos + 1)
//            break;
//    IPtext[i] = text;
//    return 0;
//}
//
//int F1(int i) {
//    int r, c, b[6];
//    for (int j = 0; j < 6; j++)
//        b[j] = X[i][j];
//    r = b[0] * 2 + b[5];
//    c = 8 * b[1] + 4 * b[2] + 2 * b[3] + b[4];
//    if (i == 0) return S1[r][c];
//    else if (i == 1) return S2[r][c];
//    else if (i == 2) return S3[r][c];
//    else if (i == 3) return S4[r][c];
//    else if (i == 4) return S5[r][c];
//    else if (i == 5) return S6[r][c];
//    else if (i == 6) return S7[r][c];
//    else if (i == 7) return S8[r][c];
//    return 0;
//}
//
//int XOR(int a, int b) { return (a ^ b); }
//
//int ToBits(int value) {
//    int k, j, m;
//    static int i;
//    if (i % 32 == 0) i = 0;
//    for (j = 3; j >= 0; j--) {
//        m = 1 << j;
//        k = value & m;
//        X2[3 - j + i] = (k == 0) ? 0 : 1;
//    }
//    i += 4;
//    return 0;
//}
//
//int SBox(int XORtext[]) {
//    int k = 0;
//    for (int i = 0; i < 8; i++)
//        for (int j = 0; j < 6; j++)
//            X[i][j] = XORtext[k++];
//    int value;
//    for (int i = 0; i < 8; i++) {
//        value = F1(i);
//        ToBits(value);
//    }
//    return 0;
//}
//
//int PBox(int pos, int text) {
//    int i;
//    for (i = 0; i < 32; i++)
//        if (P[i] == pos + 1)
//            break;
//    R[i] = text;
//    return 0;
//}
//
//void cipher(int Round, int mode) {
//    for (int i = 0; i < 32; i++)
//        expansion_function(i, RIGHT[Round - 1][i]);
//    for (int i = 0; i < 48; i++) {
//        if (mode == 0) XORtext[i] = XOR(EXPtext[i], key48bit[Round][i]);
//        else XORtext[i] = XOR(EXPtext[i], key48bit[17 - Round][i]);
//    }
//    SBox(XORtext);
//    for (int i = 0; i < 32; i++)
//        PBox(i, X2[i]);
//    for (int i = 0; i < 32; i++)
//        RIGHT[Round][i] = XOR(LEFT[Round - 1][i], R[i]);
//}
//
//void finalPermutation(int pos, int text) {
//    int i;
//    for (i = 0; i < 64; i++)
//        if (FP[i] == pos + 1)
//            break;
//    ENCRYPTED[i] = text;
//}
//
//void Encryption(long int plain[]) {
//    for (int i = 0; i < 64; i++)
//        initialPermutation(i, plain[i]);
//    for (int i = 0; i < 32; i++)
//        LEFT[0][i] = IPtext[i];
//    for (int i = 32; i < 64; i++)
//        RIGHT[0][i - 32] = IPtext[i];
//    for (int k = 1; k < 17; k++) {
//        cipher(k, 0);
//        for (int i = 0; i < 32; i++)
//            LEFT[k][i] = RIGHT[k - 1][i];
//    }
//    for (int i = 0; i < 64; i++) {
//        CIPHER[i] = (i < 32) ? RIGHT[16][i] : LEFT[16][i - 32];
//        finalPermutation(i, CIPHER[i]);
//    }
//    res64 = 0;
//    for (int i = 0; i < 64; i++)
//        res64 += (uint64_t)ENCRYPTED[i] << i;
//}
//
//void encrypt() {
//    long int plain[64];
//    for (int i = 0; i < 64; i++)
//        plain[i] = (mesg64 >> i) % 2;
//    Encryption(plain);
//}
//
//void key56to48(int round, int pos, int text) {
//    int i;
//    for (i = 0; i < 56; i++)
//        if (PC2[i] == pos + 1)
//            break;
//    key48bit[round][i] = text;
//}
//
//int key64to56(int pos, int text) {
//    int i;
//    for (i = 0; i < 56; i++)
//        if (PC1[i] == pos + 1)
//            break;
//    key56bit[i] = text;
//    return 0;
//}
//
//void key64to48(unsigned int key[]) {
//    int k, backup[17][2];
//    int CD[17][56];
//    int C[17][28], D[17][28];
//    for (int i = 0; i < 64; i++)
//        key64to56(i, key[i]);
//    for (int i = 0; i < 56; i++)
//        if (i < 28) C[0][i] = key56bit[i];
//        else D[0][i - 28] = key56bit[i];
//    for (int x = 1; x < 17; x++) {
//        int shift = SHIFTS[x - 1];
//        for (int i = 0; i < shift; i++)
//            backup[x - 1][i] = C[x - 1][i];
//        for (int i = 0; i < (28 - shift); i++)
//            C[x][i] = C[x - 1][i + shift];
//        k = 0;
//        for (int i = 28 - shift; i < 28; i++)
//            C[x][i] = backup[x - 1][k++];
//        for (int i = 0; i < shift; i++)
//            backup[x - 1][i] = D[x - 1][i];
//        for (int i = 0; i < (28 - shift); i++)
//            D[x][i] = D[x - 1][i + shift];
//        k = 0;
//        for (int i = 28 - shift; i < 28; i++)
//            D[x][i] = backup[x - 1][k++];
//    }
//    for (int j = 0; j < 17; j++) {
//        for (int i = 0; i < 28; i++)
//            CD[j][i] = C[j][i];
//        for (int i = 28; i < 56; i++)
//            CD[j][i] = D[j][i - 28];
//    }
//    for (int j = 1; j < 17; j++)
//        for (int i = 0; i < 56; i++)
//            key56to48(j, i, CD[j][i]);
//}
//
//void create16Keys() {
//    unsigned int key[64];
//    for (int i = 0; i < 64; i++)
//        key[i] = (key64 >> i) % 2;
//    key64to48(key);
//}
//
//// 二进制字符串转64位整数（适配8bit明文和64bit密钥）
//uint64_t binary_to_uint64(const char* bin_str, int target_len) {
//    uint64_t result = 0;
//    int len = strlen(bin_str);
//    // 按目标长度处理：不足补0，超出截断（8bit明文补到64bit，密钥保留64bit）
//    for (int i = 0; i < len && i < target_len; i++) {
//        if (bin_str[i] == '1') {
//            result |= (1ULL << (target_len - 1 - i)); // 高位在前
//        }
//    }
//    // 若目标是64bit（密钥/填充后的明文），不足部分补0
//    if (target_len == 64) {
//        for (int i = len; i < 64; i++) {
//            result |= 0ULL; // 补0，不影响结果
//        }
//    }
//    return result;
//}
//
//// 64位整数截取8bit并转为二进制字符串
//void uint64_to_8bit_binary(uint64_t num, char* bin_str) {
//    // 截取前8bit（可改为 & (0xFFULL) 截取后8bit，按需调整）
//    uint8_t eight_bit = (num >> 56) & 0xFF; // 右移56位取高8bit
//    for (int i = 0; i < 8; i++) {
//        bin_str[i] = (eight_bit & (1 << (7 - i))) ? '1' : '0'; // 高位在前
//    }
//    bin_str[8] = '\0';
//}
//
//int main() {
//    char key_bin[65], mesg_bin[9]; // 密钥64bit，明文8bit
//    char cipher_8bit[9];
//
//    // 输入提示：明确格式要求
//    printf("输入64位二进制密钥（0/1组成）: ");
//    cin>>key_bin;
//    printf("输入8位二进制明文（0/1组成）: ");
//    cin>> mesg_bin;
//
//    // 1. 密钥转换：64bit二进制 → uint64_t
//    key64 = binary_to_uint64(key_bin, 64);
//
//    // 2. 明文处理：8bit → 补56个0扩展为64bit → uint64_t
//    uint64_t mesg_8bit = binary_to_uint64(mesg_bin, 8);
//    mesg64 = mesg_8bit << 56; // 8bit明文移到64bit高位，低位补0（填充方式）
//
//    // 3. DES加密（完整流程：含S盒、16轮迭代等）
//    create16Keys();
//    encrypt();
//
//    // 4. 截取8bit密文并输出
//    uint64_to_8bit_binary(res64, cipher_8bit);
//    printf("8位二进制密文（截取64bit加密结果的高8bit）: %s\n", cipher_8bit);
//
//    return 0;
//}
// 
// 

//加密
//#include <iostream>
//#include <string>
//#include <utility>
//using namespace std;
//int IP[] = { 1,5,2,0,3,7,4,6 };
//int IP_[] = { 3,0,2,4,6,1,7,5 };
//int EP[] = { 3,0,1,2,1,2,3,0 };
//int	P[] = { 1,3,2,0 };
//int P10[] = { 2,4,1,6,3,9,0,8,7,5 };
//int P8[] = { 5,2,6,3,7,4,9,8 };
//int S0[4][4] = {
//	{1,0,3,2},
//	{3,2,1,0},
//	{0,2,1,3},
//	{3,1,3,0}
//};
//int S1[4][4] = {
//	{0,1,2,3},
//	{2,0,1,3},
//	{3,0,1,0},
//	{2,1,0,3}
//};
//string initialPermutation(string str, int* table, int len)
//{
//	string result;
//	for (int i = 0; i < len; i++)
//	{
//		result = result + str[table[i]];
//	}
//	return result;
//}
//string leftchange(string str, int change)
//{
//	int len = str.length();
//	change = change % len;
//	return str.substr(change) + str.substr(0, change);
//}
//pair<string, string>key(string k)
//{
//	string p10 = initialPermutation(k, P10, 10);
//	string c0 = p10.substr(0, 5);
//	string d0 = p10.substr(5, 5);
//	string c1 = leftchange(c0, 1);
//	string d1 = leftchange(d0, 1);
//	string k1 = initialPermutation(c1 + d1, P8, 8);
//	string c2 = leftchange(c1, 2);
//	string d2 = leftchange(d1, 2);
//	string k2 = initialPermutation(c2 + d2, P8, 8);
//	return { k1,k2 };
//}
//string function(string R, string key)
//{
//	string expansion = initialPermutation(R, EP, 8);
//	string xorresult;
//	for (int i = 0; i < 8; i++)
//	{
//		xorresult += (expansion[i] != key[i]) ? '1' : '0';
//	}
//	string left = xorresult.substr(0, 4);
//	string right = xorresult.substr(4, 4);
//	int r = (left[0] - '0') * 2 + (left[3] - '0');
//	int c = (left[1] - '0') * 2 + (left[2] - '0');
//	int s0v = S0[r][c];
//	string s0str = (s0v & 2) ? "1" : "0";
//	s0str += (s0v & 1) ? "1" : "0";
//	r = (right[0] - '0') * 2 + (right[3] - '0');
//	c = (right[1] - '0') * 2 + (right[2] - '0');
//	int s1v = S1[r][c];
//	string s1str = (s1v & 2) ? "1" : "0";
//	s1str += (s1v & 1) ? "1" : "0";
//	string s1 = s0str + s1str;
//	return initialPermutation(s1, P, 4);
//}
//string encrypt(string p, string k)
//{
//	auto keys = key(k);
//	string k1 = keys.first;
//	string k2= keys.second;
//	string ip = initialPermutation(p, IP, 8);
//	string L0 = ip.substr(0, 4);
//	string R0 = ip.substr(4, 4);
//	string f0 = function(R0, k1);
//	string L1 = R0;
//	string R1;
//	for (int i = 0; i < 4; i++)
//	{
//		R1 += (L0[i] != f0[i]) ? '1' : '0';
//	}
//	string f1 = function(R1, k2);
//	string L2= R1;
//	string R2;
//	for (int i = 0; i < 4; i++)
//	{
//		R2 += (L1[i] != f1[i]) ? '1' : '0';
//	}
//	string s = R2 + L2;
//	return initialPermutation(s, IP_, 8);
//}
//int main()
//{
//	string p, key;
//	cin >> p >> key;
//	cout << encrypt(p, key) << endl;
//}

解密
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int IP[] = { 1,5,2,0,3,7,4,6 };
int IP_[] = { 3,0,2,4,6,1,7,5 };
int EP[] = { 3,0,1,2,1,2,3,0 };
int	P[] = { 1,3,2,0 };
int P10[] = { 2,4,1,6,3,9,0,8,7,5 };
int P8[] = { 5,2,6,3,7,4,9,8 };
int S0[4][4] = {
	{1,0,3,2},
	{3,2,1,0},
	{0,2,1,3},
	{3,1,3,0}
};
int S1[4][4] = {
	{0,1,2,3},
	{2,0,1,3},
	{3,0,1,0},
	{2,1,0,3}
};
string initialPermutation(string str, int* table, int len)
{
	string result;
	for (int i = 0; i < len; i++)
	{
		result = result + str[table[i]];
	}
	return result;
}
string leftchange(string str, int change)
{
	int len = str.length();
	change = change % len;
	return str.substr(change) + str.substr(0, change);
}
pair<string, string>key(string k)
{
	string p10 = initialPermutation(k, P10, 10);
	string c0 = p10.substr(0, 5);
	string d0 = p10.substr(5, 5);
	string c1 = leftchange(c0, 1);
	string d1 = leftchange(d0, 1);
	string k1 = initialPermutation(c1 + d1, P8, 8);
	string c2 = leftchange(c1, 2);
	string d2 = leftchange(d1, 2);
	string k2 = initialPermutation(c2 + d2, P8, 8);
	return { k1,k2 };
}
string function(string R, string key)
{
	string expansion = initialPermutation(R, EP, 8);
	string xorresult;
	for (int i = 0; i < 8; i++)
	{
		xorresult += (expansion[i] != key[i]) ? '1' : '0';
	}
	string left = xorresult.substr(0, 4);
	string right = xorresult.substr(4, 4);
	int r = (left[0] - '0') * 2 + (left[3] - '0');
	int c = (left[1] - '0') * 2 + (left[2] - '0');
	int s0v = S0[r][c];
	string s0str = (s0v & 2) ? "1" : "0";
	s0str += (s0v & 1) ? "1" : "0";
	r = (right[0] - '0') * 2 + (right[3] - '0');
	c = (right[1] - '0') * 2 + (right[2] - '0');
	int s1v = S1[r][c];
	string s1str = (s1v & 2) ? "1" : "0";
	s1str += (s1v & 1) ? "1" : "0";
	string s1 = s0str + s1str;
	return initialPermutation(s1, P, 4);
}
string encrypt(string p, string k)
{
	auto keys = key(k);
	string k1 = keys.first;
	string k2 = keys.second;
	string ip = initialPermutation(p, IP, 8);
	string L0 = ip.substr(0, 4);
	string R0 = ip.substr(4, 4);
	string f0 = function(R0, k2);
	string L1 = R0;
	string R1;
	for (int i = 0; i < 4; i++)
	{
		R1 += (L0[i] != f0[i]) ? '1' : '0';
	}
	string f1 = function(R1, k1);
	string L2 = R1;
	string R2;
	for (int i = 0; i < 4; i++)
	{
		R2 += (L1[i] != f1[i]) ? '1' : '0';
	}
	string s = R2 + L2;
	return initialPermutation(s, IP_, 8);
}
int main()
{
	string p, key;
	cin >> p >> key;
	cout << encrypt(p, key) << endl;
}